A further extension of Yap's construction for ?-critical graphs
نویسنده
چکیده
Yap introduced in [12] (J. Graph Theory (5 (1981) 159) a method for constructing -critical graphs. The construction has been extended by Plantholt [8] (J. Graph Theory 9 (1985) 371), Hilton and Zhao [5] (Discrete Appl. Math. 76 (1997) 205), and McMichael [6] (Preprint). It was shown in [5] that if G∗ is a graph obtained by splitting any vertex into two vertices from a -regular class 1 graph G, where ¿ 2 ( √ 7− 1)|G|+ 2, then G∗ is -critical. In this note, we further extend Yap’s construction by establishing the following result: if G∗ is a graph obtained from a -regular class 1 graph G, where ¿ |G|=2, by splitting any vertex of G into two vertices x and y such that x and y are minor vertices in G∗, then G∗ is -critical. c © 2002 Elsevier Science B.V. All rights reserved.
منابع مشابه
More Equienergetic Signed Graphs
The energy of signed graph is the sum of the absolute values of the eigenvalues of its adjacency matrix. Two signed graphs are said to be equienergetic if they have same energy. In the literature the construction of equienergetic signed graphs are reported. In this paper we obtain the characteristic polynomial and energy of the join of two signed graphs and thereby we give another construction ...
متن کاملA particle swarm optimization algorithm for minimization analysis of cost-sensitive attack graphs
To prevent an exploit, the security analyst must implement a suitable countermeasure. In this paper, we consider cost-sensitive attack graphs (CAGs) for network vulnerability analysis. In these attack graphs, a weight is assigned to each countermeasure to represent the cost of its implementation. There may be multiple countermeasures with different weights for preventing a single exploit. Also,...
متن کاملConstructing vertex decomposable graphs
Recently, some techniques such as adding whiskers and attaching graphs to vertices of a given graph, have been proposed for constructing a new vertex decomposable graph. In this paper, we present a new method for constructing vertex decomposable graphs. Then we use this construction to generalize the result due to Cook and Nagel.
متن کاملAn Ant Colony Optimization Algorithm for Network Vulnerability Analysis
Intruders often combine exploits against multiple vulnerabilities in order to break into the system. Each attack scenario is a sequence of exploits launched by an intruder that leads to an undesirable state such as access to a database, service disruption, etc. The collection of possible attack scenarios in a computer network can be represented by a directed graph, called network attack gra...
متن کاملConstructions of antimagic labelings for some families of regular graphs
In this paper we construct antimagic labelings of the regular complete multipartite graphs and we also extend the construction to some families of regular graphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 243 شماره
صفحات -
تاریخ انتشار 2002